Generalized Hamming weights of a class of linear codes
نویسنده
چکیده
In [22], Kelan Ding and Cunsheng Ding presented a class of linear codes and determined their weight distributions. In this paper, we focus on the generalized Hamming weights of these codes. In order to do so, we study the quadratic forms over subspaces of finite field and obtain some interesting results about subspaces and their dual spaces. On this basis, we solve all the generalized Hamming weights of these linear codes.
منابع مشابه
A class of cyclotomic linear codes and their generalized Hamming weights
Abstract Firstly, we give a formula on the generalized Hamming weight of linear codes constructed generically by defining sets. Secondly, by choosing properly the defining set we obtain a class of cyclotomic linear codes and then present two alternative formulas to calculate their generalized Hamming weights. Lastly, we determine their weight distribution and generalized Hamming weights partial...
متن کاملComputation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملOn the generalized Hamming weights of convolutional codes
Motivated by applications in cryptology, Wei (1991) introduced the concept of a generalized Hamming weight for a linear block code. In this correspondence, we define generalized Hamming weights for the class of convolutional codes and we derive several of their basic properties. By restricting to convolutional codes having a generator matrix G(D) with bounded Kronecker indices we are able to de...
متن کاملOn the Generalized Hamming Weights of Convolutional
Motivated by applications in cryptology K. Wei introduced in 1991 the concept of a generalized Hamming weight for a linear block code. In this paper we deene generalized Hamming weights for the class of convolutional codes and we derive several of their basic properties. By restricting to convolutional codes having a generator matrix G(D) with bounded Kronecker indices we are able to derive upp...
متن کاملGeneralized rank weights : a duality statement
We consider linear codes over some fixed finite field extension Fqm/Fq, where Fq is an arbitrary finite field. In [1], Gabidulin introduced rank metric codes, by endowing linear codes over Fqm with a rank weight over Fq and studied their basic properties in analogy with linear codes and the classical Hamming distance. Inspired by the characterization of the security in wiretap II codes in terms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1708.05478 شماره
صفحات -
تاریخ انتشار 2017